completions on partial matrices ?
نویسنده
چکیده
An n × n matrix is called an N0-matrix if all its principal minors are nonpositive. In this paper, we are interested in N0-matrix completion problems, that is, when a partial N0-matrix has an N0-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N0-matrix does not have an N0-matrix completion. Here, we prove that a combinatorially symmetric partial N0-matrix, with no null main diagonal entries, has an N0-matrix completion if the graph of its specified entries is a 1-chordal graph or a cycle. We also analyze the mentioned problem when the partial matrix has some null main diagonal entries.
منابع مشابه
ACI-matrices all of whose completions have the same rank∗
We characterize the ACI-matrices all of whose completions have the same rank, determine the largest number of indeterminates in such partial matrices of a given size, and determine the partial matrices that attain this largest number. AMS classifications: 15A03, 15A99
متن کاملSingular, Nonsingular, and Bounded Rank Completions of ACI-Matrices
An affine column independent matrix is a matrix whose entries are polynomials of degree at most 1 in a number of indeterminates where no indeterminate appears with a nonzero coefficient in two different columns. A completion is a matrix obtained by giving values to each of the indeterminates. Affine column independent matrices are more general than partial matrices where each entry is either a ...
متن کاملMatrix Completion for the Independence Model
We investigate the problem of completing partial matrices to rank-1 probability matrices. The motivation for studying this problem comes from statistics: A lack of desired completion can provide a falsification test for partial observations to come from the independence model. For each type of partial matrix, we give an inequality in the observed entries which is satisfied if and only if a desi...
متن کاملPosets of Finite Functions
The symmetric group S(n) is partially ordered by Bruhat order. This order is extended by L. Renner to the set of partial injective functions of {1, 2, . . . , n} (see, Linear Algebraic Monoids, Springer, 2005). This poset is investigated by M. Fortin in his paper The MacNeille Completion of the Poset of Partial Injective Functions [Electron. J. Combin., 15, R62, 2008]. In this paper we show tha...
متن کاملUnitary Completions Of Complex Symmetric And Skew Symmetric Matrices ∗
Unitary symmetric completions of complex symmetric matrices are obtained via Autonne decomposition. The problem arises from atomic physics. Of independent interest unitary skew symmetric completions of skew symmetric matrices are also obtained by Hua decomposition.
متن کاملCompletion of Hankel Partial Contractions of Extremal Type
We find concrete necessary and sufficient conditions for the existence of contractive completions of Hankel partial contractions of size 4×4 in the extremal case. Along the way we introduce a new approach that allows us to solve, algorithmically, the contractive completion problem for 4 × 4 Hankel matrices. As an application, we obtain a concrete example of a partially contractive 4× 4 Hankel m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009